State-efficient Time-optimum Synchronization Protocols for Two-dimensional Arrays -A Survey-
نویسنده
چکیده
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a survey on recent developments in firing squad synchronization algorithms for synchronizing large-scale two-dimensional cellular automata. Several new algorithms and their stateefficient implementations are also given.
منابع مشابه
Two-Dimensional Cellular Automata Synchronizers
We study a firing squad synchronization problem that gives a finite-state protocol for synchronizing large-scale cellular automata. In this paper, we give a survey on recent developments in designing optimumand non-optimum-time synchronization algorithms and present their state-efficient implementations for two-dimensional cellular arrays. Several simple, state-efficient mapping schemes are pro...
متن کاملA Survey on Optimum-Time Firing Squad Synchronization Algorithms for One-Dimensional Cellular Automata
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we examine the state transition rule sets for the famous firing squad synchronization algorithms that give a finite-state protocol for synchronizing large-scale cellular automata and present a comparative stud...
متن کاملHow to Synchronize Large-Scale Ultra-Fine-Grained Processors in Optimum-Time
Abstract—We introduce a new class of FSSP (firing squad synchronization problem) algorithms based on recursive-halving and construct a survey on recent developments in FSSP algorithms for one-dimensional cellular arrays. We present herein a comparison of the quantitative aspects of the optimum-time FSSP algorithms developed so far. Several state-efficient new implementations and new insights in...
متن کاملYet Another New Optimum-time Synchronization Algorithm for Two-dimensional Arrays
The firing squad synchronization problem has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed. In the present paper, we give a new optimum-time algorithm for synchronizing twodimensional cellular automata. Its state-efficient implementation is also given.
متن کاملA Simple Optimum-Time FSSP Algorithm for Multi-Dimensional Cellular Automata
The firing squad synchronization problem (FSSP) on cellular automata has been studied extensively for more than forty years, and a rich variety of synchronization algorithms have been proposed for not only one-dimensional arrays but two-dimensional arrays. In the present paper, we propose a simple recursive-halving based optimum-time synchronization algorithm that can synchronize any rectangle ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006